Switching Circuits with Computer Applications.
نویسندگان
چکیده
منابع مشابه
Multi-Valued Logic Applications in the Design of Switching Circuits
In this paper we review the development & advantages of multi valued logic. The multi valued logic has been object of research over last few decades. Since 1971 there have been annual symposiums on multi valued logic. The use of non binary logic or discrete-analog signal processing is not out of the question if the multiple-valued hardware algorithms are developed for fast parallel operations. ...
متن کاملProbabilistic switching circuits in DNA
A natural feature of molecular systems is their inherent stochastic behavior. A fundamental challenge related to the programming of molecular information processing systems is to develop a circuit architecture that controls the stochastic states of individual molecular events. Here we present a systematic implementation of probabilistic switching circuits, using DNA strand displacement reaction...
متن کاملComputer simulations of stimulus dependent state switching in basic circuits of bursting neurons
Mikhail Rabinovich, Ramón Huerta, Maxim Bazhenov, Alexander K. Kozlov, and Henry D. I. Abarbanel* Institute for Nonlinear Science, University of California, San Diego, La Jolla, California 92093-0402 Department of Computer Engineering, Universidad Autónoma de Madrid, 29049 Madrid, Spain Howard Hughes Medical Institute, The Salk Institute, Computational Neurobiology Laboratory, La Jolla, Califor...
متن کاملCertifying polynomials for AC0[⊕] circuits, with applications
In this paper, we introduce and develop the method of certifying polynomials for proving AC0[⊕] circuit lower bounds. We use this method to show that Approximate Majority cannot be computed by AC0[⊕] circuits of size n1+o(1). This implies a separation between the power of AC0[⊕] circuits of nearlinear size and uniform AC0[⊕] (and even AC0) circuits of polynomial size. This also implies a separa...
متن کاملCertifying polynomials for AC[⊕] circuits, with applications
In this paper, we introduce and develop the method of certifying polynomials for proving AC[⊕] circuit lower bounds. We use this method to show that Approximate Majority cannot be computed by AC[⊕] circuits of size n. This implies a separation between the power of AC[⊕] circuits of near-linear size and uniform AC[⊕] (and even AC) circuits of polynomial size. This also implies a separation betwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Tables and Other Aids to Computation
سال: 1959
ISSN: 0891-6837
DOI: 10.2307/2002827